Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
471	A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems? Vincent Froese, Ren´e van Bevern, Rolf Niedermeier, and Manuel Sorge Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berli Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-06-19 10:42:56 Complexity classes Mathematical optimization Structural complexity theory NP-complete problems Parameterized complexity NP-complete P versus NP problem NP FO Theoretical computer science Computational complexity theory Applied mathematics
472	A multiprover interactive proof system for the local Hamiltonian problem Joseph Fitzsimons∗ Thomas Vidick† Abstract Add to Reading List Source URL: www.quantum-lab.org Language: English - Date: 2014-11-28 23:31:17 Quantum information science Complexity classes Interactive proof system QMA NEXPTIME IP Probabilistically checkable proof Qubit Quantum computer Theoretical computer science Applied mathematics Computational complexity theory
473	1 Efficient Reasoning about Data Trees via Integer Linear Programming CLAIRE DAVID, Universit´e Paris-Est LEONID LIBKIN, University of Edinburgh TONY TAN, University of Edinburgh Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2012-04-27 14:06:25 Electronic design automation Formal methods Logic in computer science NP-complete problems Complexity classes Satisfiability Modulo Theories Symbol Boolean satisfiability problem P-complete Theoretical computer science Computational complexity theory Applied mathematics
474	Smoothed Particle Hydrodynamics Problem Sets Daniel Price ASTROSIM summer school Torun Poland July 13, 2010 Add to Reading List Source URL: users.monash.edu.au Language: English - Date: 2010-07-12 22:33:55 Viscosity Mathematical analysis Euler equations Time derivative Mathematics Computational fluid dynamics Physics Smoothed-particle hydrodynamics
475	Computer Science University of Manchester The Prospective Student’s Introduction to the Robot Learning Problem Ulrich Nehmzow and Tom Mitchell Add to Reading List Source URL: aass.oru.se Language: English - Date: 2005-03-31 13:13:26 Computational statistics Q-learning Mobile robot Robotics Reinforcement learning Supervised learning Robot Concept learning Cognitive robotics Machine learning Artificial intelligence Learning
476	Average Case Lower Bounds for Monotone Switching Networks Yuval Filmus∗∗ Toniann Pitassi∗† Robert Robere∗‡ Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2014-02-13 16:02:33 Order theory Computational complexity theory Functional analysis Monotonic function Real analysis Circuit complexity Aanderaa–Karp–Rosenberg conjecture Clique problem Mathematics Mathematical analysis Theoretical computer science
477	Querying Approximate Shortest Paths in Anisotropic Regions∗ Siu-Wing Cheng† Hyeon-Suk Na‡ Antoine Vigneron§ Add to Reading List Source URL: www.cs.ust.hk Language: English - Date: 2010-04-22 09:35:25 Search algorithms Computational geometry Combinatorial optimization Routing algorithms Network theory Shortest path problem Voronoi diagram Point location Time complexity Theoretical computer science Mathematics Computational complexity theory
478	Statistical parsing inference: The General Problem Seven Lectures on Statistical Parsing • Someone gives you a PCFG G • For any given sentence, you might want to: Add to Reading List Source URL: nlp.stanford.edu Language: English - Date: 2007-08-06 23:23:06 Science Theoretical computer science Computational linguistics Bioinformatics Stochastic context-free grammar Bottom-up parsing Complexity classes Parsing Parse tree Linguistics Statistical natural language processing Formal languages
479	k Newsletter of the Parameterized Complexity Community fpt.wikidot.com www.fpt.wikidot.com Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2014-10-14 03:31:39 Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity Michael Fellows Kernelization Clique problem Vertex cover Path decomposition Theoretical computer science Computational complexity theory Applied mathematics
480	Journal of Artificial Intelligence Research234 Submitted 8/14; published 1/15 On the Subexponential-Time Complexity of CSP Ronald de Haan Add to Reading List Source URL: www.jair.org Language: English - Date: 2015-01-30 21:27:29 Constraint programming Constraint satisfaction problem Constraint satisfaction Exponential time hypothesis Boolean satisfiability problem NP-complete Tree decomposition Conjunctive normal form Time complexity Theoretical computer science Applied mathematics Computational complexity theory

UPDATE